Finitary Open Logic Program
نویسنده
چکیده
منابع مشابه
A Complete Deductive System for the μ-Calculus
The propositional μ-calculus as introduced by Kozen in [12] is considered. In that paper a finitary axiomatisation of the logic was presented but its completeness remained an open question. Here a different finitary axiomatisation of the logic is proposed and proved to be complete. The two axiomatisations are compared.
متن کاملCraig Interpolation of PDL
It seems to be an open question whether Propositional Dynamic Logic (PDL) has Craig Interpolation. In fact, it even seems to be an open question if this is an open question: Multiple proofs have been claimed to be found but all of them also have been claimed to be wrong, both more or less publicly. This report tries to clarify the situation by discussing the proof by Daniel Leivant [11] from 19...
متن کاملFragment of Nonstandard Analysis with a Finitary Consistency Proof
We introduce a nonstandard arithmetic NQA− based on the theory developed by R. Chuaqui and P. Suppes in [2] (we will denote it by NQA+), with a weakened external open minimization schema. A finitary consistency proof for NQA− formalizable in PRA is presented. We also show interesting facts about the strength of the theories NQA− and NQA+; NQA− is mutually interpretable with I∆0 + EXP, and on th...
متن کاملDefinability, Canonical Models, and Compactness for Finitary Coalgebraic Modal Logic
This paper studies coalgebras from the perspective of the finitary observations that can be made of their behaviours. Based on the terminal sequence, notions of finitary behaviours and finitary predicates are introduced. A category Behω(T ) of coalgebras with morphisms preserving finitary behaviours is defined. We then investigate definability and compactness for finitary coalgebraic modal logi...
متن کامل“ A Domain Equation for
Abramsky’s seminal article [3] is devoted to a detailed concurrency-theoretic application of the author’s “theory of domains in logical form” programme [4]. One of the main results in [3] is a logical characterization of the finitary bisimulation (cf. Theorem 5.8 on p. 191). (See [5] for a behavioural characterization of the finitary bisimulation.) More precisely, Abramsky shows that two proces...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003